A Generalization of Haussler's Convolution Kernel Mapping Kernel
نویسندگان
چکیده
منابع مشابه
A Ontology Kernel - A Convolution Kernel for Ontology Alignment
Every ontology entity such as a concept or a property has its own structural information represented as a graph due to the relations with other entities. Therefore, it is important to consider not only its lexical similarity but also structural similarity in ontology alignment. This paper proposes ontology kernel that computes both types of similarities simultaneously. The idea of this kernel i...
متن کاملOntology Kernel A Convolution Kernel for Ontology Alignment
Every ontology entity such as a concept or a property has its own structural information represented as a graph due to the relations with other entities. Therefore, it is important to consider not only its lexical similarity but also structural similarity in ontology alignment. This paper proposes ontology kernel that computes both types of similarities simultaneously. The idea of this kernel i...
متن کاملSyntactic Tree-based Relation Extraction Using a Generalization of Collins and Duffy Convolution Tree Kernel
Relation extraction is a challenging task in natural language processing. Syntactic features are recently shown to be quite effective for relation extraction. In this paper, we generalize the state of the art syntactic convolution tree kernel introduced by Collins and Duffy. The proposed generalized kernel is more flexible and customizable, and can be conveniently utilized for systematic genera...
متن کاملOn the Convolution Type Kernel Regression Estimator
This paper discusses modiications of the convolution type kernel regression estimator. One modiication uses kernel quantile estimators and is analyzed more detailed. This regression estimator combines advantages of local polynomial and kernel regression estimators and can be applied for small to large sample size. Its properties are illustrated by simulation results and asymptotic theory. Espec...
متن کاملDescending-Path Convolution Kernel for Syntactic Structures
Convolution tree kernels are an efficient and effective method for comparing syntactic structures in NLP methods. However, current kernel methods such as subset tree kernel and partial tree kernel understate the similarity of very similar tree structures. Although soft-matching approaches can improve the similarity scores, they are corpusdependent and match relaxations may be task-specific. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2009
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.24.263